Image Stitching using Watersheds and Graph Cuts
نویسنده
چکیده
Image stitching is commonly used in many different applications. One such application could be creating panoramas or high resolution images. To create seamless images is often very computationally demanding. On the other hand, the technological evolution of the latest years has created a customer demand for these algorithms to be used in handheld devices, such as cameras and cell phones. The methods need therefore to be faster in order to work in near real-time on mobile devices. Using one of the simpler algorithms often results in degrading artifacts, such as artificial seams or blurred regions. To favor seamless blending and clarity in the blending areas, while keeping a low computational cost, is the main motivation for this report. In this report the implementation of a fast image blending algorithm, based on the watershed algorithm and graph cuts, is presented [5]. The images are first aligned using SURF-matches.
منابع مشابه
A comparative performance of gray level image thresholding using normalized graph cut based standard S membership function
In this research paper, we use a normalized graph cut measure as a thresholding principle to separate an object from the background based on the standard S membership function. The implementation of the proposed algorithm known as fuzzy normalized graph cut method. This proposed algorithm compared with the fuzzy entropy method [25], Kittler [11], Rosin [21], Sauvola [23] and Wolf [33] method. M...
متن کاملImage Stitching of the Computed Radiology images Using a Pixel-Based Approach
In this paper, a method for automatic stitching of radiology images based on pixel features has been presented. In this method, according to the smooth texture of radiological images and in order to increase the number of the extracted features after quality enhancement of initial radiology images, 45 degree isotropic mask is applied to each radiology image to observe the image details. After t...
متن کاملFast Image Blending using Watersheds and Graph Cuts
This paper presents a novel approach for combining a set of registered images into a composite mosaic with no visible seams and minimal texture distortion. To promote execution speed in building large area mosaics, the mosaic space is divided into disjoint regions of image intersection based on a geometric criterion. Pair-wise image blending is performed independently in each region by means of...
متن کاملEfficient Image Stitching in the Presence of Dynamic Objects and Structure Misalignment
This paper presents a new method for simultaneously eliminating visual artifacts caused by moving objects and structure misalignment in image stitching. Given that the input images are roughly aligned, our approach is implemented in two stages. In the first stage, we discover motions between input images, and then extract their corresponding regions through a multi-seed based region growing alg...
متن کاملSome links between extremum spanning forests, watersheds and min-cuts
Minimum cuts, extremum spanning forests and watersheds have been used as the basis for powerful image segmentation procedures. In this paper, we present some results about the links which exist between these different approaches. Especially, we show that extremum spanning forests are particular cases of watersheds from arbitrary markers and that min-cuts coincide with extremum spanning forests ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010